{\rtf1\ansi\ansicpg1252\cocoartf949\cocoasubrtf540
{\fonttbl\f0\fswiss\fcharset0 ArialMT;}
{\colortbl;\red255\green255\blue255;}
\vieww12000\viewh15840\viewkind0
\deftab720
\pard\pardeftab720\ql\qnatural

\f0\fs20 \cf0 @Of the stack and queue algorithms, which do you think will run faster?\
\
\
\
@Of the stack and queue algorithms, which do you think will give the shortest paths?\
\
\
\
@Give a brief outline of how you plan to implement your project. Be sure to include something about class structure, how you will handle switching between the stack, queue, and optimal algorithms, and an abbreviated timeline (including dates) of when you plan to have different portions of your project completed. These dates should be in the format "mm/dd/yy:". An example:\
\
09/11/09:  Read project spec.\
\
I'm a bit skeptic of my abilities on this project--I have never had to do a full program from scratch, so class design might be an issue for me.  In terms of a basic outline, I plan on implement a "Kirby" class which will hold functions like getopt_long, as well as parsing the maze input.  The Kirby class, as of now, will have two significant private variables--one for the maze (based on "Maze" class) and one for the algorithm used (based on "Algorithm" class).  The Algorithm class will be a virtual base class.  Three classes will subclass from Algorithm, including Stack, Queue, and Optimal, which will all implement the "solve" function in their own specific way.  Each class will also hold specific private variables (i.e. Stack will have an STL stack, Queue will have an STL queue, Optimal...not sure yet).  To switch easily between these algorithms, the Kirby class will have a private variable of type pointer-to-Algorithm (the virtual base class).  There will be three functions in the Algorithm class, each of which returns a reference to a static instance of a specific Algorithm.  When options are read in, this pointer to Algorithm will then point to the desired Algorithm type.  The one major design issue I still have is the data structure(s) I will use to store the maze in such a way that any STL container (queue, stack) can work with it.\
\
Timeline:\
09/11/09:  Read project spec.\
09/13/09:  Finish implementation of getopt_long\
09/15/09:  Begin class creation\
09/18/09:  Complete input/output operations\
09/22/09:  Implement all algorithms\
Test/debug until due date}